Equivalence classes of n-dimensional proper Hadamard matrices

نویسنده

  • Kenneth Ma
چکیده

Equivalence operations for n-dimensional proper Hadamard matrices are defined. Their equivalence classes are investigated and bounds on the number of such equivalence classes are found to be associated with the number of equivalence classes of 2-dimensional Hadamard matrices. Properties of planes (2-dimensional sections) in an n-dimensional proper Hadamard matrix are investigated. It is shown that all planes of an ndimensional proper Hadamard matrix are Hadamard equivalent to the 2-dimensional Hadamard matrix from which it is constructed, regardless of whether the construction technique applied is Product Construction, Group Development or Relative Difference Set Construction. The relationship of the three constructions is demonstrated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Small circulant complex Hadamard matrices of Butson type

We study the circulant complex Hadamard matrices of order n whose entries are l-th roots of unity. For n = l prime we prove that the only such matrix, up to equivalence, is the Fourier matrix, while for n = p+ q, l = pq with p, q distinct primes there is no such matrix. We then provide a list of equivalence classes of such matrices, for small values of n, l.

متن کامل

Permutation Equivalence Classes of Kronecker Products of Unitary Fourier Matrices

Kronecker products of unitary Fourier matrices play important role in solving multilevel circulant systems by a multidimensional Fast Fourier Transform. They are also special cases of complex Hadamard (Zeilinger) matrices arising in many problems of mathematics and thoretical physics. The main result of the paper is splitting the set of all kronecker products of unitary Fourier matrices into pe...

متن کامل

Some Properties of Binary Matrices and Quasi-Orthogonal Signals Based on Hadamard Equivalence

We apply the Hadamard equivalence to all the binary matrices of the size m × n and study various properties of this equivalence relation and its classes. We propose to use HR-minimal as a representative of each equivalence class, and count and/or estimate the number of HRminimals of size m×n. Some properties and constructions of HR-minimals are investigated. Especially, we figure that the weigh...

متن کامل

On the classification of Hadamard matrices of order 32

All equivalence classes of Hadamard matrices of order at most 28 have been found by 1994. Order 32 is where a combinatorial explosion occurs on the number of inequivalent Hadamard matrices. We find all equivalence classes of Hadamard matrices of order 32 which are of certain types. It turns out that there are exactly 13,680,757 Hadamard matrices of one type and 26,369 such matrices of another t...

متن کامل

ON DESIGNS CONSTRUCTED FROM HADAMARD MATRICES SHOAIB UD DIN and V. C. MAVRON

There is a well-known correspondence between symmetric 2-(4ju— 1,2/z — 1,/z — 1) designs and Hadamard matrices of order 4^. It is not so well known that there is a natural correspondence between Hadamard matrices of order 2\x and affine l-(4ju, 2^, 2(i) designs whose duals are also affine. Such a design is denoted by H^fi) in this paper. Under this natural correspondence, two H^fi) designs are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2002